An Introduction to Partial Deduction
نویسنده
چکیده
After several years of neglect, the importance of partial deduction (previously, partial evaluation in logic programming) as an omnipresent principle in Logic Programming, and to a certain degree in computing in general, is being recognized. This article provides a systematic introduction to partial deduction, its applications and open problems. Starting from an informal and intuitive presentation, the fundamental notions such as correctness and completeness are discussed. A selection of applications is presented to illustrate partial deduction in different contexts.
منابع مشابه
An Automatic Partial Deduction System for Constraint Logic Programs
This paper presents a new procedure of partial deduction of various constraint logic programs. The procedure takes a program-goal pair (P0, Q0) as input and outputs a resultant program-goal pair (Pn, Qn). The procedure always terminates and the computational equivalence of the program-goal pairs (P0, Q0) and (Pn, Qn) is preserved. Pn is more efficient in solving Qn than P0 in solving Q0. Our pr...
متن کاملThe Effect of Partial Deduction in Abductive Reasoning
Partial deduction is known as an optimization technique in logic programming. In the context of abductive logic programming, however, we present in this paper that normal partial deduction does not preserve explanations for abductive reasoning. Then we provide an alternative method of partial deduction, called abductive partial deduction, which is shown to preserve the meanings of abductive log...
متن کاملA Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration
The relation between partial deduction and the unfold/fold approach has been a matter of intense discussion. In this paper we consolidate the advantages of the two approaches and provide an extended partial deduction framework in which most of the tupling and deforestation transformations of the fold/unfold approach, as well the current partial deduction transformations, can be achieved. Moreov...
متن کاملSonic Partial Deduction
The current state of the art for ensuring finite unfolding of logic programs consists of a number of online techniques where unfolding decisions are made at specialisation time. Introduction of a static termination analysis phase into a partial deduction algorithm permits unfolding decisions to be made offline, before the actual specialisation phase itself. This separation improves specialisati...
متن کاملAn Almost Perfect Abstraction Operator for Partial Deduction
A partial deduction strategy for logic programs usually uses an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are produced. Finding an abstraction operator which guarantees niteness and still does not loose relevant information (with respect to the partial deduction) is a diicult problem. In 4] and 7] Gallagher and Bruynooghe proposed to base th...
متن کامل